Snapshots

Snapshots.

Lazy Snapshots

Determining the global state of distributed systems is an important problem in the absence of global memory and global clocks. Several algorithms have been proposed for collecting global states. This paper presents an optimization to the algorithm proposed by Chandy and Lamport that lets processes in a distributed system take a lazy approach to recording their state. The lazy optimization relax...

Dynamic Atomic Snapshots

Snapshots are useful tools for monitoring big distributed and parallel systems. In this paper, we adapt the well-known atomic snapshot abstraction to dynamic models with an unbounded number of participating processes. Our dynamic snapshot specification extends the API to allow changing the set of processes whose values should be returned from a scan operation. We introduce the ephemeral memory ...

Time-Lapse Snapshots

A snapshot scan algorithm takes an “instantaneous” picture of a region of shared memory that may be updated by concurrent processes. Many complex shared memory algorithms can be greatly simplifkd by structuring them around the snapshot scan abstraction. Unfortunately, the substantial decrease in conceptual complexity is quite often countetkknced by an increase in computational complexity. In th...

On Distributed Snapshots

We develop an efficient snapshot algorithm that needs no control messages and does not require channels to be first-in-first-out. We also show that several stable properties (e.g., termination, deadlock) can be detected with uncoordinated distributed snapshots. For such properties, our algorithm can be further simplified.